A Cellular Structure for a Versatile Reed-Solomon Decoder
نویسندگان
چکیده
A new cellular structure for a versatile Reed-Solomon (RS) decoder is introduced based on time domain decoding algorithm. The time domain decoding algorithm is restructured to be suitable for introducing the cellular structure. The main advantages of this structure are its versatility and very simple cellular structure. By versatile decoder we mean a decoder that can be programmed to decode any (n, k) RS code defined in Galois field 2 with a fixed block length n and a fixed symbol size m. This decoder can correct both errors and erasures for any message length k. The introduced decoder is cellular and has a very simple structure and hence it is suitable for VLSI designs.
منابع مشابه
A Versatile Time-Domain Reed-Solomon Decoder
A versatile Reed-Solomon (RS) decoder structure is developed based on the time-domain decoding algorithm (transform decoding without transforms). In this paper, the algorithm is restructured and a method is given to decode any RS code generated by any generator polynomial. The main advantage of the introduced decoder structure is the versatility. By versatile decoder we mean a decoder that can ...
متن کاملReed Solomon Decoder: TMS320C64x Implementation
This application report describes a Reed Solomon decoder implementation on the TMS320C64x DSP family. Reed Solomon codes have been widely accepted as the preferred (ECC) error control coding scheme for ADSL networks, digital cellular phones and high-definition television systems. The reason for their widespread prevalence is their excellent robustness to burst errors. Programmable implementati...
متن کاملEfficient Reed Solomon Decoder Based on pRiBM Algorithm for Effective Digital Signal Reception
In this paper, Reed Solomon (RS) decoder adopting the pipelined reduced inversion free Berlekamp Massey (pRiBM) algorithm is proposed. This Reed Solomon decoder is designed by equipping the Syndrome Computation unit, Key Equation Solver (KES), Chien search and Forney algorithm unit. The RS decoder requires long latency for decoding large number of test vectors. Therefore, the Reed Solomon decod...
متن کاملPipelined recursive modified Euclidean algorithm block for low-complexity, high-speed Reed–Solomon decoder
A novel pipelined recursive modified Euclidean (ME) algorithm block for the low-complexity, high-speed Reed–Solomon (RS) decoder is presented. The deeply pipelined recursive structure enables implementation of a significantly low-complexity ME algorithm block with much improved clock frequency. The low-complexity, high-speed RS decoder using the pipelined recursive ME algorithm block has been i...
متن کاملHigh-speed decoder of Reed-Solomon codes
A high speed decoding algorithm using a modified step-by-step method for t-error-correcting Reed-Solomon codes is introduced. Based on this algorithm, a sequential decoder and a vector decoder are then proposed. These two decoders can be constructed by four basic modules: the syndrome calculation module, the comparison module, the decision module, and the shift-control module. These decoders ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 46 شماره
صفحات -
تاریخ انتشار 1997